0.07/0.17	% Problem    : Vampire---4.8_11152 : TPTP v0.0.0. Released v0.0.0.
0.07/0.18	% Command    : run_E %s %d THM
0.14/0.40	% Computer : n019.cluster.edu
0.14/0.40	% Model    : x86_64 x86_64
0.14/0.40	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.40	% Memory   : 8042.1875MB
0.14/0.40	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.40	% CPULimit   : 1440
0.14/0.40	% WCLimit    : 180
0.14/0.40	% DateTime   : Mon Jul  3 12:48:20 EDT 2023
0.14/0.41	% CPUTime    : 
0.20/0.54	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152
0.20/0.54	# Version: 3.1pre001-ho
0.20/0.55	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.55	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.55	# Starting new_ho_10 with 900s (5) cores
0.20/0.55	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.55	# Starting sh4l with 180s (1) cores
0.20/0.55	# Starting ehoh_best_nonlift_rwall with 180s (1) cores
0.20/0.55	# sh4l with pid 11415 completed with status 0
0.20/0.55	# Result found by sh4l
0.20/0.55	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.55	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.55	# Starting new_ho_10 with 900s (5) cores
0.20/0.55	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.55	# Starting sh4l with 180s (1) cores
0.20/0.55	# No SInE strategy applied
0.20/0.55	# Search class: HGHNF-FFSF00-SFFFFFNN
0.20/0.55	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.55	# Starting new_ho_10 with 109s (1) cores
0.20/0.55	# new_ho_10 with pid 11418 completed with status 0
0.20/0.55	# Result found by new_ho_10
0.20/0.55	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.55	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.55	# Starting new_ho_10 with 900s (5) cores
0.20/0.55	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.55	# Starting sh4l with 180s (1) cores
0.20/0.55	# No SInE strategy applied
0.20/0.55	# Search class: HGHNF-FFSF00-SFFFFFNN
0.20/0.55	# Scheduled 5 strats onto 1 cores with 180 seconds (180 total)
0.20/0.55	# Starting new_ho_10 with 109s (1) cores
0.20/0.55	# Preprocessing time       : 0.001 s
0.20/0.55	# Presaturation interreduction done
0.20/0.55	
0.20/0.55	# Proof found!
0.20/0.55	# SZS status Theorem
0.20/0.55	# SZS output start CNFRefutation
0.20/0.55	thf(decl_22, type, mel: $i).
0.20/0.55	thf(decl_23, type, zoey: $i).
0.20/0.55	thf(decl_24, type, knight: $i > $o).
0.20/0.55	thf(decl_25, type, knave: $i > $o).
0.20/0.55	thf(decl_26, type, says: $i > $o > $o).
0.20/0.55	thf(knights_tell_truth, axiom, ![X1:$i, X2:$o]:(((X2)<=((knight @ X1)&(says @ X1 @ ((X2)))))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', knights_tell_truth)).
0.20/0.55	thf(knights_xor_knaves, axiom, ![X1:$i]:(((knight @ X1)<~>(knave @ X1))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', knights_xor_knaves)).
0.20/0.55	thf(who_is_knight_and_knave, conjecture, ?[X3:$i, X4:$i]:(((knave @ X4)&(knight @ X3))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', who_is_knight_and_knave)).
0.20/0.55	thf(knaves_lie, axiom, ![X1:$i, X2:$o]:((~((X2))<=((knave @ X1)&(says @ X1 @ ((X2)))))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', knaves_lie)).
0.20/0.55	thf(mel_speaks, axiom, (says @ mel @ ((~((knave @ zoey))&~((knave @ mel))))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', mel_speaks)).
0.20/0.55	thf(zoey_speaks, axiom, (says @ zoey @ ((knave @ mel))), file('/export/starexec/sandbox/tmp/tmp.yqUGgCw38Q/Vampire---4.8_11152', zoey_speaks)).
0.20/0.55	thf(c_0_6, plain, ![X1:$i, X2:$o]:((((knight @ X1)&(says @ X1 @ ((X2))))=>(X2))), inference(fof_simplification,[status(thm)],[knights_tell_truth])).
0.20/0.55	thf(c_0_7, plain, ![X1:$i]:(~(((knight @ X1)<=>(knave @ X1)))), inference(fof_simplification,[status(thm)],[knights_xor_knaves])).
0.20/0.55	thf(c_0_8, negated_conjecture, ~(?[X3:$i, X4:$i]:(((knave @ X4)&(knight @ X3)))), inference(assume_negation,[status(cth)],[who_is_knight_and_knave])).
0.20/0.55	thf(c_0_9, plain, ![X12:$i, X13:$o]:((~(knight @ X12)|~(says @ X12 @ ((X13)))|(X13))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
0.20/0.55	thf(c_0_10, plain, ![X14:$i]:(((~(knight @ X14)|~(knave @ X14))&((knight @ X14)|(knave @ X14)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])).
0.20/0.55	thf(c_0_11, negated_conjecture, ![X17:$i, X18:$i]:((~(knave @ X18)|~(knight @ X17))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
0.20/0.55	thf(c_0_12, plain, ![X1:$i, X2:$o]:((((knave @ X1)&(says @ X1 @ ((X2))))=>~(X2))), inference(fof_simplification,[status(thm)],[knaves_lie])).
0.20/0.55	thf(c_0_13, plain, ((~((~(knave @ zoey)&~(knave @ mel)))|(says @ mel @ $true))&((~(knave @ zoey)&~(knave @ mel))|(says @ mel @ $false))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[mel_speaks])])).
0.20/0.55	thf(c_0_14, plain, ![X1:$i]:((~((knight @ X1))|~((says @ X1 @ (~($true)))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_9])])])).
0.20/0.55	thf(c_0_15, plain, ![X1:$i]:(((knight @ X1)|(knave @ X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
0.20/0.55	thf(c_0_16, axiom, ((~(knave @ mel)|(says @ zoey @ $true))&((knave @ mel)|(says @ zoey @ $false))), inference(fool_unroll,[status(thm)],[zoey_speaks])).
0.20/0.55	thf(c_0_17, negated_conjecture, ![X1:$i, X3:$i]:((~((knave @ X1))|~((knight @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])).
0.20/0.55	thf(c_0_18, plain, ![X15:$i, X16:$o]:((~(knave @ X15)|~(says @ X15 @ ((X16)))|~(X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])).
0.20/0.55	thf(c_0_19, plain, (((knave @ zoey)|(knave @ mel)|(says @ mel @ $true))&((~(knave @ zoey)|(says @ mel @ $false))&(~(knave @ mel)|(says @ mel @ $false)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
0.20/0.55	thf(c_0_20, plain, ![X1:$i]:(((knave @ X1)|~((says @ X1 @ (~($true)))))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.20/0.55	thf(c_0_21, plain, ((knave @ mel)|(says @ zoey @ (~($true)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.55	thf(c_0_22, negated_conjecture, ![X1:$i, X3:$i]:(((knave @ X1)|~((knave @ X3)))), inference(spm,[status(thm)],[c_0_17, c_0_15])).
0.20/0.55	thf(c_0_23, plain, ![X1:$i]:((~((knave @ X1))|~((says @ X1 @ (($true)))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_18])])])).
0.20/0.55	thf(c_0_24, plain, ((says @ zoey @ (($true)))|~((knave @ mel))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.55	thf(c_0_25, plain, ((says @ mel @ (~($true)))|~((knave @ zoey))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.55	thf(c_0_26, plain, (knave @ zoey), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
0.20/0.55	thf(c_0_27, plain, (~((knave @ zoey))|~((knave @ mel))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
0.20/0.55	thf(c_0_28, plain, (says @ mel @ (~($true))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
0.20/0.55	thf(c_0_29, plain, ~((knave @ mel)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_26])])).
0.20/0.55	thf(c_0_30, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_28]), c_0_29]), ['proof']).
0.20/0.55	# SZS output end CNFRefutation
0.20/0.55	# Parsed axioms                        : 11
0.20/0.55	# Removed by relevancy pruning/SinE    : 0
0.20/0.55	# Initial clauses                      : 15
0.20/0.55	# Removed in clause preprocessing      : 5
0.20/0.55	# Initial clauses in saturation        : 10
0.20/0.55	# Processed clauses                    : 26
0.20/0.55	# ...of these trivial                  : 0
0.20/0.55	# ...subsumed                          : 1
0.20/0.55	# ...remaining for further processing  : 25
0.20/0.55	# Other redundant clauses eliminated   : 0
0.20/0.55	# Clauses deleted for lack of memory   : 0
0.20/0.55	# Backward-subsumed                    : 3
0.20/0.55	# Backward-rewritten                   : 3
0.20/0.55	# Generated clauses                    : 10
0.20/0.55	# ...of the previous two non-redundant : 9
0.20/0.55	# ...aggressively subsumed             : 0
0.20/0.55	# Contextual simplify-reflections      : 1
0.20/0.55	# Paramodulations                      : 9
0.20/0.55	# Factorizations                       : 0
0.20/0.55	# NegExts                              : 0
0.20/0.55	# Equation resolutions                 : 0
0.20/0.55	# Total rewrite steps                  : 3
0.20/0.55	# Propositional unsat checks           : 0
0.20/0.55	#    Propositional check models        : 0
0.20/0.55	#    Propositional check unsatisfiable : 0
0.20/0.55	#    Propositional clauses             : 0
0.20/0.55	#    Propositional clauses after purity: 0
0.20/0.55	#    Propositional unsat core size     : 0
0.20/0.55	#    Propositional preprocessing time  : 0.000
0.20/0.55	#    Propositional encoding time       : 0.000
0.20/0.55	#    Propositional solver time         : 0.000
0.20/0.55	#    Success case prop preproc time    : 0.000
0.20/0.55	#    Success case prop encoding time   : 0.000
0.20/0.55	#    Success case prop solver time     : 0.000
0.20/0.55	# Current number of processed clauses  : 9
0.20/0.55	#    Positive orientable unit clauses  : 2
0.20/0.55	#    Positive unorientable unit clauses: 0
0.20/0.55	#    Negative unit clauses             : 1
0.20/0.55	#    Non-unit-clauses                  : 6
0.20/0.55	# Current number of unprocessed clauses: 2
0.20/0.55	# ...number of literals in the above   : 2
0.20/0.55	# Current number of archived formulas  : 0
0.20/0.55	# Current number of archived clauses   : 16
0.20/0.55	# Clause-clause subsumption calls (NU) : 8
0.20/0.55	# Rec. Clause-clause subsumption calls : 8
0.20/0.55	# Non-unit clause-clause subsumptions  : 3
0.20/0.55	# Unit Clause-clause subsumption calls : 3
0.20/0.55	# Rewrite failures with RHS unbound    : 0
0.20/0.55	# BW rewrite match attempts            : 1
0.20/0.55	# BW rewrite match successes           : 1
0.20/0.55	# Condensation attempts                : 26
0.20/0.55	# Condensation successes               : 0
0.20/0.55	# Termbank termtop insertions          : 802
0.20/0.55	
0.20/0.55	# -------------------------------------------------
0.20/0.55	# User time                : 0.005 s
0.20/0.55	# System time              : 0.001 s
0.20/0.55	# Total time               : 0.007 s
0.20/0.55	# Maximum resident set size: 1780 pages
0.20/0.55	
0.20/0.55	# -------------------------------------------------
0.20/0.55	# User time                : 0.005 s
0.20/0.55	# System time              : 0.004 s
0.20/0.55	# Total time               : 0.010 s
0.20/0.55	# Maximum resident set size: 1708 pages
0.20/0.55	% E---3.1 exiting
0.20/0.55	EOF